منابع مشابه
Isomorphism of a Fuzzy Graph Using Fuzzy Matrix Equality
In this study we discuss about an application of fuzzy graph isomorphism. If we look two unequal fuzzy matrices on undirected fuzzy graphs, we cannot say either the fuzzy graphs of theses fuzzy matrices are isomorphic or not isomorphic. It is because two fuzzy matrices may look different even if the fuzzy graphs are isomorphic. In this study, by using the algorithm for fuzzy graph isomorphism i...
متن کاملA Term Equality Problem Equivalent to Graph Isomorphism
We demonstrate that deciding if two terms containing otherwise uninter-preted associative, commutative, and associative-commutative function symbols and commutative variable-binding operators are equal is polynomially equivalent to determining if two graphs are isomorphic. The reductions we use provide insight into this result and suggest polynomial time special cases.
متن کاملGraph isomorphism is polynomial
We show that the graph isomorphism problem is determined in a polynomial time. This is done by showing that that two graphs on n vertices are isomorphic if and only if a corresponding system of (4n− 1)n equations in n nonnegative variables is solvable. 2000 Mathematics Subject Classification: 03D15, 05C50, 05C60, 15A48, 15A51, 15A69, 90C05.
متن کاملApproximate equality is no fuzzy equality
We argue that fuzzy equivalences, and in particular fuzzy equalities, in general are not suitable to model approximate equality due to the notion of transitivity. Using them for this purpose therefore leads to counter-intuitive results, as we illustrate in detail in a fuzzy relationbased framework for the representation of linguistic modifiers. We solve the problem by choosing resemblance relat...
متن کاملSyntactic Isomorphism of CNF Boolean Formulas is Graph Isomorphism Complete
We investigate the complexity of the syntactic isomorphism problem of CNF Boolean Formulas (CSFI): given two CNF Boolean formulas φ(a1, . . . , an) and φ(b1, . . . , bn) decide whether there exists a permutation of clauses, a permutation of literals and a bijection between their variables such that φ(a1, . . . , an) and φ(b1, . . . , bn) become syntactically identical. We first show that the CS...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Indagationes Mathematicae
سال: 2013
ISSN: 0019-3577
DOI: 10.1016/j.indag.2013.09.002